A:es_realizer{i:l}, i:Id.
((R-has-loc(A; i)))  (R-da(A; i) = fpf-empty  fpf(Knd; k.Type)) 

latex

Definitions

guard(T), Knd, A, tt, P  Q, P  Q, P  Q, P  Q, prop{i:l}, if b then t else f fi , ff, x. t(x), t  T, R-da(R; i), R-has-loc(R; i), b, P  Q, x:A. B(x), False, x(s), , Unit, es_realizer{i:l}, Rrframe(loc; x; L), Rbframe(loc; k; L), Raframe(loc; k; L), Rpre(loc; ds; a; p; P), Rsends(ds; knd; T; l; dt; g), Reffect(loc; ds; knd; T; x; f), Rsframe(lnk; tag; L), Rframe(loc; T; x; L), Rinit(loc; T; x; v), Rplus(left; right), Rnone,

Lemmas

fpf-is-empty wf, assert of band, top wf, fpf-trivial-subtype-top, fpf-join-is-empty, assert-fpf-is-empty, es realizer wf, locl wf, p-outcome wf, lnk-decl wf, assert of bnot, eqff to assert, bnot wf, eqtt to assert, iff transitivity, fpf-single wf3, ifthenelse wf, lsrc wf, assert-eq-id, eq id wf, assert of bor, not functionality wrt iff, implies functionality wrt iff, Kind-deq wf, R-da wf, fpf-join wf, R-has-loc wf, bor wf, assert wf, all functionality wrt iff, false wf, not wf, fpf-empty wf, bool wf, finite-prob-space wf, decl-type wf, decl-state wf, fpf wf, IdLnk wf, Knd wf, rationals wf, Id wf, unit wf